A Scalable Memory-Ef cient Architecture for Parallel Shared Memory Switches
نویسنده
چکیده
Parallel shared memory (PSM) switch architectures were initially introduced as means of resolving the high memory bandwidth requirements imposed by output-queued switches. At the core of the PSM architecture is a memory management algorithm that determines, for each arriving packet, the memory unit in which it will be placed. Recent work has indicated that in order to achieve high throughput, the number of parallel memories needed is O N ; thereby signi cantly limiting scalability. This paper introduces a novel pipelined memory management algorithm which maintains a computational complexity of O (1) while reducing the number of required parallel memories to O (N). Our goal is to extend existing shared-memory architecture results in the context of Fabric on a Chip (FoC) a paradigm that advocates the consolidation of core packet switching functions on a single chip. A detailed discussion is provided pertaining to the fundamental properties of the proposed scheme, along with hardware implementation considerations that illustrate its scalability and performance attributes.
منابع مشابه
Next Generation Internet High-Speed Switches and Routers
Shared memory architecture for packet switches was normally thought to be unsuitable for building high performance switches/routers. The main reason lies in their perceived poor scalability. In particular, shared memory architectures are typically used to build output-queued switches which are regarded as the best candidate to achieve optimal delay-throughput performance. The current trend in r...
متن کاملEfficient Parallelization of Unstructured Reductions on Shared Memory Parallel Architectures
This paper presents a new parallelization method for an ef-cient implementation of unstructured array reductions on shared memory parallel machines with OpenMP. This method is strongly related to parallelization techniques for irregular reductions on distributed memory machines as employed in the context of High Performance Fortran. By exploiting data locality, synchronization is minimized with...
متن کاملParallelizing Tabled Evaluations (Extended Abstract)
SLG is a table-oriented resolution method that extends SLD evaluation in two ways. It computes the well-founded model for logic programs with negation with polynomial data complexity, and it terminates for programs with the bounded-term-size property. Furthermore SLG has an ef-cient sequential implementation for modularly stratiied programs in the SLG-WAM of XSB. This paper addresses general is...
متن کاملMultigrain Shared Memory Multigrain Shared Memory
Parallel workstations, each comprising a 10-100 processor shared memory machine, promise cost-e ective general-purpose multiprocessing. This thesis explores the coupling of such smallto medium-scale shared memory multiprocessors through software over a local area network to synthesize larger shared memory systems. Multiprocessors built in this fashion are called Distributed Scalable Shared memo...
متن کاملcient Parallelization of Unstructured Reductions on Shared Memory Parallel Architectures ?
This paper presents a new parallelization method for an efcient implementation of unstructured array reductions on shared memory parallel machines with OpenMP. This method is strongly related to parallelization techniques for irregular reductions on distributed memory machines as employed in the context of High Performance Fortran. By exploiting data locality, synchronization is minimized witho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006